A Novel, Generic Graph Model for TraÆc Grooming in Heterogeneous WDM Mesh Networks

As the operation of our ber-optic backbone networks migrates from interconnected SONET rings to arbitrary mesh topology, traÆc grooming on WDM mesh networks becomes an extremely important research problem. To address this problem, we propose a new, generic graph model for traÆc grooming in heterogeneous WDM mesh networks. The novelty of our model is that, by only manipulating the edges of the auxiliary graph created by our model and the weights of these edges, our model can achieve various objectives using di erent grooming policies, while taking into account various constraints such as transceivers, wavelengths, wavelength-conversion capabilities, and grooming capabilities. Based on the auxiliary graph, we develop an integrated traÆc-grooming algorithm (IGABAG) and an integrated grooming procedure (INGPROC) which jointly solve several traÆc-grooming sub-problems by simply applying the shortest-path computation method. Di erent grooming policies can be represented by di erent weight-assignment functions, and the performance of these grooming policies are compared under both non-blocking scenario and blocking scenario. The integrated traÆc-grooming algorithm can be applied to both static and dynamic traÆc grooming. In static grooming, the traÆc-selection scheme is key to achieving good network performance. We propose several traÆc-selection schemes based on this model and we evaluate their performance for di erent network topologies.